Dynamic Backtracking
نویسنده
چکیده
Because of their occasional need to return to shallow points in a search tree, existing backtracking methods can sometimes erase meaningful progress toward solving a search problem. In this paper, we present a method by which backtrack points can be moved deeper in the search space, thereby avoiding this di culty. The technique developed is a variant of dependency-directed backtracking that uses only polynomial space while still providing useful control information and retaining the completeness guarantees provided by earlier approaches.
منابع مشابه
Dynamic Backtracking with Constraint Propagation Application to numeric csps
Recent works on constraint relaxation [Jussien, 1997; Jussien and Boizumault, 1997b] provided the decorum system (Deduction-based Constraint Relaxation Management). That system can be seen as an integration of arc-consistency within the dynamic backtracking algorithm [Ginsberg, 1993]. Dynamic backtracking replaces the backtracking process by a much less blind behavior that consists in local mod...
متن کاملDynamic Branch&Bound, an optimization counterpart for dynamic backtracking
Here we show how the idea of dynamic backtracking can be applied to branch and bound optimization. This is done by exploiting the concept of valued nogood introduced in [6, 16, 17]. However, simple replacement of nogoods with valued nogoods does not lead to a correct algorithm. We show that a way to achieve correctness is to use at each variable a separate nogood storage for each position that ...
متن کاملGeneralizing Partial Order and Dynamic Backtracking
RecentlyFtwo new backtracking algorithmsF dynamic backtracking (DB) and partial order dynamic backtracking (PDB) have been presented. These algorithms have the property to be additive on disjoint subproblems and yet use only polynomial space. Unlike DBFPDB only imposes a partial search order and therefore appears to have more freedom than DB to explore the search space. HoweverFboth algorithms ...
متن کاملDynamic Backtracking with Constraint Propagation
Recent works on constraint relaxation [Jussien, 1997; Jussien and Boizumault, 1997b] provided the decorum system (Deduction-based Constraint Relaxation Management). In this paper, we show how the ideas developed in that system can be used in order to integrate Constraint Propagation within the Dynamic Backtracking algorithm [Ginsberg, 1993]. Dynamic Backtracking replaces the backtracking proces...
متن کاملBacktracking Search Algorithms
There are three main algorithmic techniques for solving constraint satisfaction problems: backtracking search, local search, and dynamic programming. In this chapter, I survey backtracking search algorithms. Algorithms based on dynamic programming [15]— sometimes referred to in the literature as variable elimination, synthesis, or inference algorithms—are the topic of Chapter 7. Local or stocha...
متن کاملDynamic Domain Splitting for Numeric CSPs
In this paper, a new search technique over numeric csps is presented: dynamic domain splitting. The usual search technique over numeric csps is a dichotomic search interleaved with a consistency ltering, which is called domain splitting. This paper proposes to replace chronological backtracking at the core of domain splitting by a non destructive backtracking technique.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Artif. Intell. Res.
دوره 1 شماره
صفحات -
تاریخ انتشار 1993